The complexity of online bribery in sequential elections

Prior work on the complexity of bribery assumes that happens simultaneously, and briber has full knowledge all votes. However, in many real-world settings votes come sequentially, may have a use-it-or-lose-it moment to decide whether alter given vote, when making decision not know what remaining voters will cast. We introduce model for, initiate study of, such an online, sequential setting. show even for election systems whose winner-determination problem is polynomial-time computable, setting vastly increase bribery, jumping up completeness high levels polynomial hierarchy or PSPACE. But we also some natural, important systems, dramatic does occur, pinpoint their problems.